Secondary codebook storage quantisation

نویسندگان

  • Thomas M. Chapman
  • Costas S. Xydeas
چکیده

Efficient reduction of storage and complexity demands in VQ and MQ systems is a key issue when developing new, more powerful compression algorithms. Secondary Storage Quantisation (SSQ) is capable of drastically reducing VQ storage through an efficient representation of codebook elements. Rather than the conventional fixed or floating point representation, codebook elements are quantised using a set of “secondary codebooks” and represented as a set of quantisation indices. The number of bits required for these indices is relatively small and hence the amount of storage required for codebook representation is reduced. The potential of SSQ for codebook compression is demonstrated in a Split Matrix Quantisation (SMQ) application. A reduction of 65 75 % in the amount of memory required for SMQ codebooks is achieved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classified Vector Quantisation and population decoding for pattern recognition

Learning Vector Quantisation (LVQ) is a method of applying the Vector Quantisation (VQ) to generate references for Nearest Neighbour (NN) classification. Though successful in many occasions, LVQ suffers from several shortcomings, especially the reference vectors are prone to diverge. In this paper, we propose a Classified Vector Quantisation (CVQ) to establish VQ for classification. By CVQ, eac...

متن کامل

Using linguistic knowledge to improve the design of low-bit rate LSF quantisation

In this paper we investigate an alternative approach to the design of low-bit rate (LBR) quantisation. This approach incorporates phonetic information into the structure of Line Spectral Frequency (LSF) codebooks. In prior work vector quantisation (VQ) has been used to quantise stochastic processes. Speech signals can, however, be described in terms of phonetic segments and linguistic rules. A ...

متن کامل

Generative Vector Quantisation

{ Based on the assumption that a pattern is constructed out of features which are either fully present or absent, we propose a vector quantisation method which constructs patterns using binary combinations of features. For this model there exists an eecient EM-like learning algorithm which learns a set of representative codebook vectors. In terms of a generative model, the collection of allowed...

متن کامل

Index-compressed vector quantisation based on index mapping

The authors introduce a novel coding technique which significantly improves the performance of the traditional vector quantisation (VQ) schemes at low bit rates. High interblock correlation in natural images results in a high probability that neighbouring image blocks are mapped to small subsets of the VQ codebook, which contains highly correlated codevectors. If, instead of the whole VQ codebo...

متن کامل

Novel fuzzy reinforced learning vector quantisation algorithm and its application in image compression

A new approach to the design of optimised codebooks using vector quantisation (VQ) is presented. A strategy of reinforced learning (RL) is proposed which exploits the advantages offered by fuzzy clustering algorithms, competitive learning and knowledge of training vector and codevector configurations. Results are compared with the performance of the generalised Lloyd algorithm (GLA) and the fuz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999